Linear Point Sets and Rédei Type k-blocking Sets in PG(n, q)
نویسنده
چکیده
In this paper, k-blocking sets in PG(n, q), being of Rédei type, are investigated. A standard method to construct Rédei type k-blocking sets in PG(n, q) is to construct a cone having as base a Rédei type k′-blocking set in a subspace of PG(n, q). But also other Rédei type k-blocking sets in PG(n, q), which are not cones, exist. We give in this article a condition on the parameters of a Rédei type k-blocking set of PG(n, q = ph), p a prime power, which guarantees that the Rédei type k-blocking set is a cone. This condition is sharp. We also show that small Rédei type k-blocking sets are linear.
منابع مشابه
On the Linearity of Higher-Dimensional Blocking Sets
A small minimal k-blocking set B in PG(n, q), q = pt, p prime, is a set of less than 3(qk + 1)/2 points in PG(n, q), such that every (n − k)-dimensional space contains at least one point of B and such that no proper subset of B satisfies this property. The linearity conjecture states that all small minimal k-blocking sets in PG(n, q) are linear over a subfield Fpe of Fq. Apart from a few cases,...
متن کاملA proof of the linearity conjecture for k-blocking sets in PG(n, p), p prime
In this paper, we show that a small minimal k-blocking set in PG(n, q), q = p, h ≥ 1, p prime, p ≥ 7, intersecting every (n−k)-space in 1 (mod q) points, is linear. As a corollary, this result shows that all small minimal k-blocking sets in PG(n, p), p prime, p ≥ 7, are Fp-linear, proving the linearity conjecture (see [7]) in the case PG(n, p), p prime, p ≥ 7.
متن کاملA proof of the linearity conjecture for k-blocking sets in PG(n, p3), p prime
In this paper, we show that a small minimal k-blocking set in PG(n, q), q = p, h ≥ 1, p prime, p ≥ 7, intersecting every (n−k)-space in 1 (mod q) points, is linear. As a corollary, this result shows that all small minimal k-blocking sets in PG(n, p), p prime, p ≥ 7, are Fp-linear, proving the linearity conjecture (see [7]) in the case PG(n, p), p prime, p ≥ 7.
متن کاملBlocking sets in PG ( 2 , q n ) from cones of PG ( 2 n , q )
Let and B̄ be a subset of = PG(2n − 1, q) and a subset of PG(2n, q) respectively, with ⊂ PG(2n, q) and B̄ ⊂ . Denote by K the cone of vertex and base B̄ and consider the point set B defined by B = (K\ ) ∪ {X ∈ S : X ∩ K = ∅}, in the André, Bruck-Bose representation of PG(2, qn) in PG(2n, q) associated to a regular spread S of PG(2n − 1, q). We are interested in finding conditions on B̄ and in order...
متن کاملOn small blocking sets and their linearity
We prove that a small blocking set of PG(2, q) is “very close” to be a linear blocking set over some subfield GF(p) < GF(q). This implies that (i) a similar result holds in PG(n, q) for small blocking sets with respect to k-dimensional subspaces (0 ≤ k ≤ n) and (ii) most of the intervals in the interval-theorems of Szőnyi and Szőnyi-Weiner are empty.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001